Weakly complete axiomatization of exogenous quantum propositional logic
نویسندگان
چکیده
منابع مشابه
Weakly complete axiomatization of exogenous quantum propositional logic
A finitary axiomatization for EQPL (exogenous quantum propositional logic) is presented. The axiomatization is shown to be weakly complete relative to an oracle for analytical reasoning. The proof is carried out using a non trivial extension of the Fagin-Halpern-Megiddo technique together with three Henkin style completions.
متن کاملComplete exogenous quantum propositional logic
After an overview of EQPL (exogenous quantum propositional logic), the proof of its weak completeness is outlined, using a non trivial extension of the Fagin-Halpern-Megiddo technique. A new logic (EQPL – exogenous quantum propositional logic), embodying all that is stated in the postulates of quantum physics, was proposed in [2, 3, 4] for modeling and reasoning about quantum systems. The logic...
متن کاملThe Axiomatization of Propositional Linear Time Temporal Logic
The article introduces propositional linear time temporal logic as a formal system. Axioms and rules of derivation are defined. Soundness Theorem and Deduction Theorem are proved [9]. The terminology and notation used in this paper have been introduced in the In this paper a, b, c denote boolean numbers. Next we state three propositions: (1) (a ⇒ b ∧ c) ⇒ (a ⇒ b) = 1. (2) (a ⇒ (b ⇒ c)) ⇒ (a ∧ b...
متن کاملTowards a Complete Axiomatization for Spatial Logic
The process-based Spatial Logics are multi-modal logics developed for semantics on Process Algebras and designed to specify concurrent properties of dynamic systems. On the syntactic level, they combine modal operators similar to operators of Hennessy-Milner logic, dynamic logic, arrow logic, relevant logic, or linear logic. This combination generates expressive logics, sometimes undecidable, f...
متن کاملTableau-Like Automata-Based Axiomatization for Propositional Linear Temporal Logic
Propositional Linear Temporal Logic (PLTL) is a very popular formalism for specification and verification of computer programs and systems. This extended abstract sketches a tableau-like axiomatization for PLTL based on automata-theoretic decision procedure coupled with tableau for local model checking of the propositional μ-Calculus. Propositional Linear Temporal Logic (PLTL) is a very popular...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2006
ISSN: 0890-5401
DOI: 10.1016/j.ic.2006.02.001